Parameterized Complexity of Neighborhood Problems in Graphs with no Small Cycles
نویسندگان
چکیده
We show that several problems that are hard for various parameterized complexity classes on general graphs, become fixed parameter tractable on graphs with no small cycles. More specifically, we give fixed parameter algorithms for Dominating Set, t-Vertex Cover (where we need to cover at least t edges) and several of their variants on graphs that have no triangles or cycles of length 4. These problems are known to be W [i]-hard for some i in general graphs. We also show that the Dominating Set problem is W [2]-hard in bipartite graphs and hence on triangle free graphs. In the case of Independent Set and several of its variants, we show them fixed parameter tractable even in triangle free graphs. In contrast, we show that the Dense Subgraph problem (related to the Clique problem) is W [1]-hard on graphs with no cycles of length at most 5. Finally, we give an approximation algorithm of factor Hp+1 − 12 for the Dominating Set problem in graphs with no triangles or 4-cycles, where p is the size of an optimum dominating set of the graph. This improves the previous Hn − 12 factor approximation algorithm for the problem, where n is the number of vertices of the input graph.
منابع مشابه
Parameterized Algorithms for Conflict-free Colorings of Graphs
In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring problem is to color the vertices of a graph using the minimum number of colors such that the coloring is conflict-free. We consider both closed neighborhoods, where the neighbor...
متن کاملThe Parameterized Complexity of Counting Problems
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W[t], for t ≥ 1, that corresponds to Downey and Fellows’s W-hierarchy [13] and show that a few central W-completeness results for decision problems translate to #W-completeness results for the corresponding counting problems. Cou...
متن کاملEliminating Odd Cycles by Removing a Matching
We study the problem of determining whether a given graph G = (V,E) admits a matching M whose removal destroys all odd cycles of G (or equivalently whether G−M is bipartite). This problem is also equivalent to determine whether G admits a (1,1)-coloring, which is a 2-coloring of V (G) in which each color class induces a graph of maximum degree at most 1. We show that such a decision problem is ...
متن کاملUsing Neighborhood Diversity to Solve Hard Problems
Parameterized algorithms are a very useful tool for dealing with NP-hard problems on graphs. Yet, to properly utilize parameterized algorithms it is necessary to choose the right parameter based on the type of problem and properties of the target graph class. Tree-width is an example of a very successful graph parameter, however it cannot be used on dense graph classes and there also exist prob...
متن کاملFinding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
We give algorithms with running time 2O( √ k log k) · nO(1) for the following problems. Given an n-vertex unit disk graph G and an integer k, decide whether G contains a path on exactly/at least k vertices, a cycle on exactly k vertices, a cycle on at least k vertices, a feedback vertex set of size at most k, and a set of k pairwise vertex-disjoint cycles. For the first three problems, no subex...
متن کامل